Multi-proxy Multi-signature without Pairing from Certificateless Cryptography

In a multi-proxy multi-signature scheme, there is a group of original signers who delegate their signing rights to another group of persons called proxy group. Most of the known cryptography schemes used bilinear pairings, the computation cost of the which is much higher than that of the exponentiation in a RSA group. In this paper, we propose a certificateless multi-proxy multi-signature scheme based on the classic RSA and discrete logarithm (DL) problem. Our scheme is also constructed without using pairing which reduces the running time significantly, and it is secure against chosen message attack in random oracle model and more applicable for practical applications.